Hyper-minimizing minimized deterministic finite state automata
نویسندگان
چکیده
منابع مشابه
An nlogn algorithm for hyper-minimizing a (minimized) deterministic automaton
We improve a recent result [Badr: Hyper-minimization inO(n). Int. J. Found. Comput. Sci. 20, 2009] for hyper-minimized nite automata. Namely, we present an O(n log n) algorithm that computes for a given deterministic nite automaton (dfa) an almostequivalent dfa that is as small as possible such an automaton is called hyper-minimal. Here two nite automata are almost-equivalent if and only if the...
متن کاملHyper-Minimizing States in a (Minimized) Deterministic Automaton
We improve a recent result [A. Badr: Hyper-Minimization in O(n). In Proc. CIAA, LNCS 5148, 2008] for hyper-minimized finite automata. Namely, we present an O(n log n) algorithm that computes for a given finite deterministic automaton (dfa) an almost equivalent dfa that is as small as possible—such an automaton is called hyper-minimal. Here two finite automata are almost equivalent if and only i...
متن کاملAn nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton
We improve a recent result [A. Badr: Hyper-Minimization in O(n). In Proc. CIAA, LNCS 5148, 2008] for hyper-minimized finite automata. Namely, we present an O(n logn) algorithm that computes for a given finite deterministic automaton (dfa) an almost equivalent dfa that is as small as possible—such an automaton is called hyper-minimal. Here two finite automata are almost equivalent if and only if...
متن کاملCycle Analysis for Deterministic Finite State Automata
A method for the determination of all cycles of deterministic finite state automata is presented. Using a finite field description GF(2) these automata are shown to correspond to multilinear state equations. Basic results from feedback shift register theory are recalled and developed towards a complete analysis tool for affine-linear automata. The multilinear case is reduced to the affine-linea...
متن کاملHyper-minimisation of deterministic weighted finite automata over semifields
Hyper-minimisation of deterministic finite automata is a recently introduced state reduction technique that allows a finite change in the recognised language. A generalisation of this lossy compression method to the weighted setting over semifields is presented, which allows the recognised formal power series to differ for finitely many input strings. First, the structure of hyper-minimal deter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 2007
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita:2007061